Mirror graphs: graph theoretical characterization of reflection arrangements and finite Coxeter groups
نویسنده
چکیده
Mirror graphs were introduced by Brešar et al. in 2004 as an intriguing class of graphs: vertextransitive, isometrically embeddable into hypercubes, having a strong connection with regular maps and polytope structure. In this article we settle the structure of mirror graphs by characterizing them as precisely the Cayley graphs of the finite Coxeter groups or equivalently the tope graphs of reflection arrangements – well understood and classified structures. We provide a polynomial algorithm for their recognition.
منابع مشابه
Semi-edges, Reflections and Coxeter Groups
We combine the theory of Coxeter groups, the covering theory of graphs introduced by Malnic, Nedela and Skoviera and the theory of reflections of graphs in order to obtain the following characterization of a Coxeter group: Let π : Γ → (v,D, ι,−1) be a 1-covering of a monopole admitting semiedges only. The graph Γ is the Cayley graph of a Coxeter group if and only if π is regular and any deck tr...
متن کاملRelation Spaces of Hyperplane Arrangements and Modules Defined by Graphs of Fiber Zonotopes
We study the exactness of certain combinatorially defined complexes which generalize the Orlik-Solomon algebra of a geometric lattice. The main results pertain to complex reflection arrangements and their restrictions. In particular, we consider the corresponding relation complexes and give a simple proof of the n-formality of these hyperplane arrangements. As an application, we are able to bou...
متن کاملRight-angled Mock Reflection and Mock Artin Groups
We define a right-angled mock reflection group to be a group G acting combinatorially on a CAT(0) cubical complex such that the action is simply-transitive on the vertex set and all edge-stabilizers are Z2. We give a combinatorial characterization of these groups in terms of graphs with local involutions. Any such graph Γ not only determines a mock reflection group, but it also determines a rig...
متن کاملThe local recognition of reflection graphs of spherical Coxeter groups
Based on the third author’s thesis (arXiv:0805.2403) in this article we complete the local recognition of commuting reflection graphs of spherical Coxeter groups arising from irreducible crystallographic root systems.
متن کاملA Kind of Non-commuting Graph of Finite Groups
Let g be a fixed element of a finite group G. We introduce the g-noncommuting graph of G whose vertex set is whole elements of the group G and two vertices x,y are adjacent whenever [x,y] g and [y,x] g. We denote this graph by . In this paper, we present some graph theoretical properties of g-noncommuting graph. Specially, we investigate about its planarity and regularity, its clique number a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 63 شماره
صفحات -
تاریخ انتشار 2017